Constraint programing for solving four complex flexible shop scheduling problems
نویسندگان
چکیده
منابع مشابه
Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملDiscrepancy Search for solving flexible scheduling problems
Flexible scheduling problems under study are Flexible Job Shop (FJS) and Hybrid Flow Shop (HFS), which generalize traditional scheduling problems. For flexible scheduling problems it is desired to process operations on a machine chosen among a set of available ones. The objective is to find a schedule which minimizes the makespan. The FJS problem is more computationally difficult than the Job S...
متن کاملA competitive iterative procedure using a time-indexed model for solving flexible job shop scheduling problems
We investigate the efficiency of a discretization procedure utilizing a timeindexed mathematical optimization model for finding accurate solutions to flexible job shop scheduling problems considering objectives comprising the makespan and the tardiness of jobs, respectively. The time-indexed model is used to find solutions to these problems by iteratively employing time steps of decreasing leng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Collaborative Intelligent Manufacturing
سال: 2021
ISSN: 2516-8398,2516-8398
DOI: 10.1049/cim2.12005